Record statistics in integer compositions
نویسندگان
چکیده
A composition σ = a1a2 . . . am of n is an ordered collection of positive integers whose sum is n. An element ai in σ is a strong (weak) record if ai > aj (ai ≥ aj) for all j = 1, 2, . . . , i− 1. Furthermore, the position of this record is i. We derive generating functions for the total number of strong (weak) records in all compositions of n, as well as for the sum of the positions of the records in all compositions of n, where the parts ai belong to a fixed subset A of the natural numbers. In particular when A = N, we find the asymptotic mean values for the number, and for the sum of positions, of records in compositions of n.
منابع مشابه
The Möbius function of partitions with restricted block sizes
The purpose of this paper is to compute the Möbius function of filters in the partition lattice formed by restricting to partitions by type. The Möbius function is determined in terms of the descent set statistics on permutations and the Möbius function of filters in the lattice of integer compositions. When the underlying integer partition is a knapsack partition, the Möbius function on intege...
متن کاملParallel Algorithm for Second-Order Restricted Weak Integer Composition Generation for Shared Memory Machines
In 2012, Page presented a sequential combinatorial generation algorithm for generalized types of restricted weak integer compositions called second–order restricted weak integer compositions. Second–order restricted weak integer compositions cover various types of restricted weak integer compositions of n parts such as integer compositions, bounded compositions, and part–wise integer compositio...
متن کاملCorrections to the results derived in "A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions"'; and a comparison of four restricted integer composition generation algorithms
In this note, I discuss results on integer compositions/partitions given in the paper “A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions”. I also experiment with four different generation algorithms for restricted integer compositions and find the algorithm designed in the named paper to be pretty slow, comparatively. Some of my ...
متن کاملOn Conjugates for Set Partitions and Integer Compositions
There is a familiar conjugate for integer partitions: transpose the Ferrers diagram, and a conjugate for integer compositions: transpose a Ferrers-like diagram. Here we propose a conjugate for set partitions and exhibit analogous pairs of statistics interchanged by the conjugate on set partitions and integer compositions respectively. 0 The Conjugate of an Integer Partition A partition of n is ...
متن کاملSome Inplace Identities for Integer Compositions
In this paper, we give two new identities for compositions, or ordered partitions, of integers. These two identities are based on closely-related integer partition functions which have recently been studied. Thanks to the structure inherent in integer compositions, we are also able to extensively generalize both of these identities. Bijective proofs are given and generating functions are provid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009